fixList = [
    {
        "origin":   "int GetMaxcommonDivisor(int m,int n){\n" +
                    "    int r;\n" +
                    "    while(n!=0){\n" +
                    "        r=m%n;\n" +
                    "        m=n;\n" +
                    "        n=r;\n" +
                    "    }\n" +
                    "    return n;\n" +
                    "}\n",
        "fix":      "int GetMaxcommonDivisor(int m,int n){\n" +
                    "    int r;\n" +
                    "    while(n!=0){\n" +
                    "        r=m%n;\n" +
                    "        m=n;\n" +
                    "        n=r;\n" +
                    "    }\n" +
                    "    return m;\n" +
                    "}\n",
        "probability": 58,
        "hasError": True
    }
]

history = [
    {
        "origin": "int GetMaxcommonDivisor(int m,int n){\n" +
                  "    int r;\n" +
                  "    while(n!=0){\n" +
                  "        r=m%n;\n" +
                  "        m=n;\n" +
                  "        n=r;\n" +
                  "    }\n" +
                  "    return n;\n" +
                  "}\n",
        "fix": "int GetMaxcommonDivisor(int m,int n){\n" +
               "    int r;\n" +
               "    while(n!=0){\n" +
               "        r=m%n;\n" +
               "        m=n;\n" +
               "        n=r;\n" +
               "    }\n" +
               "    return m;\n" +
               "}\n",
        "probability": 58,
        "hasError": True
    },
    {
        "origin": "int GetMaxcommonDivisor(int m,int n){\n" +
                  "    int r;\n" +
                  "    while(n!=0){\n" +
                  "        r=m%n;\n" +
                  "        m=n;\n" +
                  "        n=r;\n" +
                  "    }\n" +
                  "    return n;\n" +
                  "}\n",
        "fix": "int GetMaxcommonDivisor(int m,int n){\n" +
               "    int r;\n" +
               "    while(n!=0){\n" +
               "        r=m%n;\n" +
               "        m=n;\n" +
               "        n=r;\n" +
               "    }\n" +
               "    return m;\n" +
               "}\n",
        "probability": 78,
        "hasError": True
    },
    {
        "origin": "int GetMaxcommonDivisor(int m,int n){\n" +
                  "    int r;\n" +
                  "    while(n!=0){\n" +
                  "        r=m%n;\n" +
                  "        m=n;\n" +
                  "        n=r;\n" +
                  "    }\n" +
                  "    return n;\n" +
                  "}\n",
        "fix": "int GetMaxcommonDivisor(int m,int n){\n" +
               "    int r;\n" +
               "    while(n!=0){\n" +
               "        r=m%n;\n" +
               "        m=n;\n" +
               "        n=r;\n" +
               "    }\n" +
               "    return m;\n" +
               "}\n",
        "probability": 67,
        "hasError": True
    },
    {
        "origin": "int GetMaxcommonDivisor(int m,int n){\n" +
                  "    int r;\n" +
                  "    while(n!=0){\n" +
                  "        r=m%n;\n" +
                  "        m=n;\n" +
                  "        n=r;\n" +
                  "    }\n" +
                  "    return n;\n" +
                  "}\n",
        "fix": "int GetMaxcommonDivisor(int m,int n){\n" +
               "    int r;\n" +
               "    while(n!=0){\n" +
               "        r=m%n;\n" +
               "        m=n;\n" +
               "        n=r;\n" +
               "    }\n" +
               "    return m;\n" +
               "}\n",
        "probability": 0,
        "hasError": False
    }
]